Hamiltonian cycles in bipartite quadrangulations on the torus
نویسندگان
چکیده
In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple closed curve visiting each face and each vertex of G exactly once but crossing no edge. As an application, we conclude that the radial graph of any bipartite quadrangulation on the torus has a hamiltonian cycle.
منابع مشابه
Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices
Let G be a 3-connected bipartite graph with partite sets X ∪ Y which is embeddable in the torus. We shall prove that G has a Hamiltonian cycle if (i) G is blanced , i.e., |X| = |Y |, and (ii) each vertex x ∈ X has degree four. In order to prove the result, we establish a result on orientations of quadrangular torus maps possibly with multiple edges. This result implies that every 4-connected to...
متن کاملThe Topology of Scaling Limits of Positive Genus Random Quadrangulations
We discuss scaling limits of large bipartite quadrangulations of positive genus. For a given g, we consider, for every n ≥ 1, a random quadrangulation qn uniformly distributed over the set of all rooted bipartite quadrangulations of genus g with n faces. We view it as a metric space by endowing its set of vertices with the graph distance. As n tends to infinity, this metric space, with distance...
متن کاملHamiltonian cycles on random lattices of arbitrary genus
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It has been difficult to count the number of Hamiltonian cycles on regular lattices with periodic boundary conditions, e.g. lattices on a torus, due to the presence of winding modes. In this paper, the exact number of Hamiltonian cycles on a random trivalent fat graph drawn faithfully on a torus is obta...
متن کاملEdge-disjoint Hamiltonian cycles in two-dimensional torus
The torus is one of the popular topologies for the interconnecting processors to build high-performance multicomputers. This paper presents methods to generate edge-disjoint Hamil-tonian cycles in 2D tori. 1. Introduction. A multicomputer system consists of multiple nodes that communicate by exchanging messages through an interconnection network. At a minimum, each node normally has one or more...
متن کاملDisjoint hamiltonian cycles in bipartite graphs
Let G = (X, Y ) be a bipartite graph and define σ 2(G) = min{d(x) + d(y) : xy / ∈ E(G), x ∈ X, y ∈ Y }. Moon and Moser [5] showed that if G is a bipartite graph on 2n vertices such that σ 2(G) ≥ n + 1 then G is hamiltonian, sharpening a classical result of Ore [6] for bipartite graphs. Here we prove that if G is a bipartite graph on 2n vertices such that σ 2(G) ≥ n+ 2k− 1 then G contains k edge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 69 شماره
صفحات -
تاریخ انتشار 2012